Total Game Coloring of Graphs
نویسندگان
چکیده
Total variant of well known graph coloring game is considered. We determine exact values of χ ′′ g for some classes of graphs and show that total game chromatic number is bounded from above by ∆ + 3∆ +. We also show relation between total game coloring number and game coloring index.
منابع مشابه
Just chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملA Simple Competitive Graph Coloring Algorithm
We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this result to give very easy proofs of the best known upper bounds on game coloring number for forests, i...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملEdge Game Coloring of Graphs1
Corresponding to the game chromatic number of graphs, we consider in this paper the game chromatic index χg of graphs, which is defined similarly, except that edges, instead of vertices of graphs are colored. Upper bounds for trees and wheels are given.
متن کاملGame-perfect graphs
A graph coloring game introduced by Bodlaender [3] as coloring construction game is the following. Two players, Alice and Bob, alternately color vertices of a given graph G with a color from a given color set C, so that adjacent vertices receive distinct colors. Alice has the first move. The game ends if no move is possible any more. Alice wins if every vertex of G is colored at the end, otherw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.7653 شماره
صفحات -
تاریخ انتشار 2012